Cipher-code.



W. 0011111" 0 J. J. RASKOB.

1 ,7 17 n n n n n n 7 n n i: ,v' n n o n 1 n n n p, n v n r:

q n n 9) n v r u r n 1! n s 1: n n )7 t y; n a; n v

u v v n v v n v n '1 w- 1| 4! 71 77 II x 1v )7 17 n n y n v 91 17 I) z nv :1 71

Qwi ltmoom:

GIPHER CODE.

1911101111011 FILED SEPT. 10, 1909.

from

- from rom from

from

from from from

be used '"beforg a11- KEY words beIaw 10000 Patented Feb. 7, 1911.

THE NORRIS PETERS c0., WASHINGYON, n, c.

2 SHEETS-SHEET 1.

39,999 inc.

49,999 inc.

79,999 imk 89,999 ins.

99,999 inc.

109,999 inc.-

119,999 inc.

129,999 inc.

W. GOYNE & J. J. RASKOB.

GIPHER CODE. 12211101110011 FILED SEPT. 10, 1900.

983,482. Patented Feb. 7, 1911.

2 snnnws-snnm 2.'

klirlx 10,000 ktxtxf- 90.000 lmlxmx 20,000 kwmx 100,000 fixnx 50 0 kvxvx11o,000 koxox 40,000 120.000 kpxox 50,000 lo'ckxx 150,000 kqxqx 60,000lgyxyx 140,000 krxrx 70,000 kzxzx 150,000 kSXSJP- 80,000

1 2. 1 14 E E 5 Key 00rd Code Word. No. Code Word. Translatipn Oc gid45,794 Expalpanda Letter is. too indefinite nfeje 56,005 Encacho 15230you expect to be, koxox 40,000 Erpetico Require more definiteinstructions 12252 10 10000? of Kihge 1 9,875 Caranguer If you. havecommunicated with Clarke (no 0006 word) Mr. Clarke uhijg 58,907Enxelhavia Inform us of any change TOTAL 169, 660 fi ffj' 69.660 CheckWord Witwwoao 0 031 101011 032; 2 MAM THE NORRIS PETERS co.. WASHINGTON,1:.c.

FFIF.

CIPI-IER-GODE.

To all whom it may concern:

Be it known that we, WILLIAM Conan and J 0111a J. Rasxon, of Wilmington,in the county of Newcastle and in the State of Delaware, have invented acertain new and useful Improvement in Cipher-Codes, and do herebydeclare that the following is a full, clear, and exact descriptionthereof.

Our invention relates particularly to cipher codes designed to be usedin sending telegraphic and cable despatches, so that despatches whichare sent thereby may be shortened and kept secret.

The object of our invention is especially to provide a cipher code ofthis character, each part of which does not contain more than fiveletters, the limit allowed by the Western Union and Postal TelegraphCompanies, and, in fact, to use words which contain invariably the samenumber of letters. vVe have chosen five letters as the most advantageousnumber of letters of which words shall consist, but a different numberof letters may be used if found desirable. This simplifies andconsequently renders more accurate the work of the telegraph operator,inasmuch as words of five letters are much easier to remember andtransmit than Words containing a larger number of letters. At the sametime, although our code comprises words containing only five letters, asufficient number of words are provided for indicating 159,000 phrasesof any desired length. It will be seen that our code is thus ample inextent, inasmuch as the Western Union 'code contains only 158,000 codewords.

A further object of our invention is to provide a check-word, by meansof which it can be readily determined whether the message has beenaccurately sent.

A further object of our invention is to provide a code which may be usedin connection with any other private code containing numbered words ornumbered phrases. In the case of private codes which do not containnumbered words or phrases, it is only necessary to number the words orphrases therein, in order to adapt it to use in connection with ourcode.

We have shown one embodiment of our invention in the accompanyingdrawings, in which- Figure 1 indicatesa table of digits and prefixletters; Fig. 2 indicates a table giving Specification of LettersIPatent.

Application filed September 10, 1909.

Patented Feb. '7, 1911.

Serial No. 517,038.

the special key-words used to indicate the tens of thousands; Fig. 3gives a table indicating in what manner the numbers applied to anyparticular words or phrases can be translated into key-words in ourcode.

In the :form oi our invention shown in the accompanying drawings, theletters a to are used to indicate the digits of the system. These areused only in the last four places of any particular number. The numbersappearing in the fifth and sixth places of a particular number areindicated by the letters Z to e, which are to be called prefix letters.An additional prefix letter is is used to indicate that a particularnumber is below 10,000, and the above system applies to all numbersexcept the even tens of thousands, as shown in Fig. 2. In the case ofthese numbers special key-words are used. In order to indicate aparticular number by means of a key-word in our code, the tens ofthousands are first indicated by means of one 01 the letters Z to z.Supposing the number to be 13,79 1, as shown in the first example givenin Fig. 3, the 10,000 would be indicated by an 0, and the remainingfigures appearing in the number, i. 6., in the last four places, wouldbe indicated by the letters a to y', corresponding to the particulardigits.

The key-word appearing in the second example shown in F 3 is obtained ina similar manner. The third keyword in said table is a word taken directfrom the table of tens of thousands, appearing in Fig. 2.

Referring to the fourth example appearing in the table shown in Fig. 3,in case the number is less than 10,000 and the prefix letter 70 isapplied to the front of the keyword, the last four places of the numberare then indicated by the letters corresponding to the digits, in thesame manner as in the case of the first and second examples appearing inthis table. Then the number is one of less than four places the prefixletter 72 is applied, the digits of the number are represented by thecorresponding letters and the word is made one of five letters byrepresenting each of the blank spaces between the digits and the letter70 with the letter j, which represents zero. As shown in the table givenin Fig. 3, the numbers used are obtained from any code containingnumbered words or numbered phrases.

In case it is desired to apply our code to -manner described above.

use in connection with a code which does not contain numbered words orphrases, it is merely necessary to apply to the words or phrases of acode numbers in a serial order up to 159,000. If desired, a private codemay be readily constructed merely by making a list of phrases andapplying to said phrases numbers in a serial order.

In order to indicate whether a message has been correctly sent, we makeuse of a check-word. The check-word is to be added to the message at theend, and is obtained by adding together the numbers of all of the codewords or phrases sent in a particular message, and the making up of akey-word from the last five digits appearing in the total, as shown inFig. 3.

When a message is received which is unintelligible, it can be readilyshown that an error has been made in the transmission by adding up thenumbers corresponding to the key-words, and then translating thelastfive digits of this total into a check-word, and if the check-Wordsent in the message is not the same, an error has been made. The

particular point at which an error has been made can also be determinedby adding up the key-words which appear intelligible, leaving out theunintelligible words, and then subtracting this total from the totalappearing in the check-word sent. The resulting number will be thenumber of the word or phrase which has been incorrectly sent.

In the practical operation of our code many advantages appear as beforestated. The work of the telegraph operator is very much simplified andrendered much more accurate, as words of five letters are much easier toremember and transmit than words containing a greater number of letters.Absolute accuracy in the transmission can be determined by the personreceiving the message by the use of the check-word in the The receiverof the message can also determine in other ways whether. the message hasbeen correctly sent, inasmuch as every word, except the last word,should begin with some letter from is to .2, and as every word shouldcontain only five letters. i

In case two or more words have been run together by'the telegraphoperator, they can be readilyseparated by beginning each of theseparated words by letters between 70 and 2. Again, the simplicity ofthe scheme expedites the codification of messages for transmission. Thisfollows from the fact that words of five letters are easier to constructand write, and numbers are much easier to remember than letters.Finally, messages sent according to our code may be translated into thewords or phrases indicated by them with a minimum amount of labor and aminimum expenditure of time, owing to the fact that each word containsonly five letters, and also owing to the fact that a series of words orphrases indicated by a list of numbers arranged in serial order, aremuch easier to handle than a series of words or phrases indicated by alist of code words usually unpronounceable.

WVhile we have described our invention above in detail, we wish it to beunderstood that our invention is a broadpne and capable of many changeswithout departing from the spirit of our invention.

lVe claim 1. A cipher code comprising sign groups adapted to refer todifferent numbers to be sent, each of said groups containing a singlesign indicating either an arbitrary number or a number of multiples ofsaid arbitrary number in a number to be sent, and at least one signrepresenting the digits of the number to be sent that are below saidarbitrary number.

' 2. A cipher code comprising sign groups adapted to refer to differentnumbers to be sent, each of said groups containing a single prefix signindicating either an arbitrary number or a number of multiples of saidarbitrary number in a number to be sent, and at least one signrepresenting the digits of the number to be sent that are below saidarbitrary number.

3. A cipher code, comprising sign groups adapted to refer to differentnumbers having signs to represent the digits and their places, and thegroups referring to numbers below a given figure being provided 'with aspecial sign to indicate this fact.

4. A cipher code, comprising sign groups adapted to refer to differentnumbers having signs to represent the digits and their places, and thegroups referring to numbers below a given figure being provided with aspecial prefix sign to indicate this fact.

5. A cipher code, comprising sign groups adapted to refer to differentnumbers having signs to represent the digits and their places, and thegroups referring to numbers below ten thousand being provided with aspecial sign to indicate this fact.

(3. A cipher code, comprising sign groups adapted to referto differentnumbers having signs to represent the digits and their places, and thegroups referring to numbers below ten thousand being provided with aspecial prefix sign to indicate this fact.

7. A cipher code, comprising sign groups adapted to refer to numbers, agiven number of places in each number being indicated by lettersrepresenting digits, and the other places being represented by differentletters.

8. A cipher code, comprising sign groups adapted to refer to numbers, agiven number p letters a to 2', representing digits, and the otherplaces being represented by letters 70 to z.

9. A cipher code, comprising sign groups adapted to refer to differentnumbers, each of said groups containing a single sign indicating thenumber of tens of thousands in a number.

10. A cipher code, comprising sign groups of said groups containing aprefix sign indicating the number of tens of thousands in a number.

In testimony that We claim the foregoing We have hereunto set our hands.

WM. COYNE. JOHN J. RASKOB. Witnesses:

WV. S. SIMPsON, J. W. REBERT.

